1
کامپیوتر و شبکه::
گراف غیرمدور
However, the above graph partitioning algorithms or mapping algorithms are on acyclic graphs and may not provide high quality on cyclic topologies, which greatly affects the efficient usage of communication pipeline.
However, for acyclic graphs, communication pipeline can be used as much as possible, while for cyclic graphs, the usage of communi- cation pipeline is limited by the number of delayed iterations in the task loop to avoid deadlock [6].
Therefore, while load balance and communication pipeline allocation can be obtained simultaneously for acyclic graphs, the two factors re- quire a tradeoff for cyclic graphs.
Note that for acyclic graphs, the weight of CP has no impact on ILP results, so communication pipeline can be allocated after mapping and CP weight is 0.
For acyclic graphs, allocating communication pipeline between processors in one cluster is independent of other clusters, which means the ILP-based mapping can be used in the cluster locally.
واژگان شبکه مترجمین ایران